The Expected loss in the discretization of multistage stochastic programming problems - estimation and convergence rate
نویسنده
چکیده
In the present paper, the approximate computation of a multistage stochastic programming problem (MSSPP) is studied. First, the MSSPP and its discretization are defined. Second, the expected loss caused by the usage of the “approximate” solution instead of the “exact” one is studied. Third, new results concerning approximate computation of expectations are presented. Finally, the main results of the paper—an upper bound of the expected loss and an estimate of the convergence rate of the expected loss—are stated.
منابع مشابه
A Defined Benefit Pension Fund ALM Model through Multistage Stochastic Programming
We consider an asset-liability management (ALM) problem for a defined benefit pension fund (PF). The PF manager is assumed to follow a maximal fund valuation problem facing an extended set of risk factors: due to the longevity of the PF members, the inflation affecting salaries in real terms and future incomes, interest rates and market factors affecting jointly the PF liability and asset p...
متن کاملEffects of Probability Function on the Performance of Stochastic Programming
Stochastic programming is a valuable optimization tool where used when some or all of the design parameters of an optimization problem are defined by stochastic variables rather than by deterministic quantities. Depending on the nature of equations involved in the problem, a stochastic optimization problem is called a stochastic linear or nonlinear programming problem. In this paper,a stochasti...
متن کاملA multi-stage stochastic programming for condition-based maintenance with proportional hazards model
Condition-Based Maintenance (CBM) optimization using Proportional Hazards Model (PHM) is a kind of maintenance optimization problem in which inspections of a system relevant to its failure rate depending on the age and value of covariates are performed in time intervals. The general approach for constructing a CBM based on PHM for a system is to minimize a long run average cost per unit of time...
متن کاملExpected Duration of Dynamic Markov PERT Networks
Abstract : In this paper , we apply the stochastic dynamic programming to approximate the mean project completion time in dynamic Markov PERT networks. It is assumed that the activity durations are independent random variables with exponential distributions, but some social and economical problems influence the mean of activity durations. It is also assumed that the social problems evolve in ac...
متن کاملTerm Structure Models in Multistage Stochastic Programming: Estimation and Approximation
This paper investigates some common interest rate models for scenario generation in financial applications of stochastic optimization. We discuss conditions for the underlying distributions of state variables which preserve convexity of value functions in a multistage stochastic program. Oneand multi-factor term structure models are estimated based on historical data for the Swiss Franc. An ana...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Annals OR
دوره 165 شماره
صفحات -
تاریخ انتشار 2009